#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],ans[maxn];
multiset<LL>s;
bool check(LL x,LL sum){
    if( (1+x)*x/2<=sum ) return true;
    else return false;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=1;i<=n;i++) cin>>a[i],s.insert(i);
   for(LL i=n;i>=1;i--){
       LL l=0;LL r=n;
       while(l<r){
          LL mid=(l+r+1)>>1;
          if(check(mid,a[i])) l=mid;
          else r=mid-1;
       }
       l++;
       multiset<LL>::iterator it;
       it=s.lower_bound(l);
       ans[i]=(*it);
       s.erase(it);
   }
   for(LL i=1;i<=n;i++){
       cout<<ans[i]<<" ";
   }
   cout<<"\n";
   return 0;
}
